Languages polylog-time reducible to dot-depth 1/2
نویسندگان
چکیده
منابع مشابه
Languages of Dot-Depth
We prove an effective characterization of languages having dot-depth . To our knowledge, only the classes of levels , and of the dot-depth hierarchy were known to be decidable. Let B denote the class of languages having dot-depth , i.e., languages that can be written as finite unions of languages of the form u L u L u Lnun, where ui A and Li are languages of dot-depth one. 1. Let k . We define ...
متن کاملCounting with Counterfree Automata
We study the power of balanced regular leaf-languages. First, we investigate (i) regular languages that are polylog-time reducible to languages in dot-depth 1/2 and (ii) regular languages that are polylog-time decidable. For both classes we provide • forbidden-pattern characterizations, and • characterizations in terms of regular expressions. Both classes are decidable. The intersection of clas...
متن کاملLinear-Size Constant-Depth Polylog-Treshold Circuits
We present a simple explicit construction giving unbounded fan-in circuits with $o(n)$ gates and depth $O(r)$ for the threshold function of $n$ variables when the threshold is at most $(log n)^r$, for any integer $r>0$. This improves a result of Atjai and Ben-Or, who showed the existence of circuits of size $n^{O(1)}$. This is the highest threshold for which polynomial-size, constant-depth circ...
متن کاملSome Forbidden Patterns in Automata for Dot-Depth One Languages
We deal with the class B of dot-depth one languages which forms level one of the socalled dot-depth hierarchy. For some fixed alphabet A with jAj , a language L A is in the class B if and only if it can be expressed as a Boolean combination of languages u A u A u A A un A un, where ui A and n . This class is the highest level of the dot-depth hierarchy known to be decidable up to now and a numb...
متن کاملA Semigroup Characterization of Dot-Depth one Languages
— It is shown that one can décide whether a langage has dot-depth one in the dot-depth hierarchy introduced by BrzozowskL The décision procedure is based on an algebraic characterization of the syntactic semigroup of a langage of dot-depth 0 or 1. Résumé. — On démontre que Von peut décider si un langage est de hauteur 1 dans la hiérarchie de concaténation introduite par BrzozowskL L'algorithme ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 2007
ISSN: 0022-0000
DOI: 10.1016/j.jcss.2006.09.004